University Course Timetabling Using ACO: A Case Study on Laboratory Exercises
نویسندگان
چکیده
The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present the design of the memory–efficient construction graph and a sophisticated solution construction procedure. The system devised here has been successfully used for timetabling at the authors’ institution.
منابع مشابه
University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study
This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of laboratory exercises in a highly constrained environment, for which a formal definition is given. Solution representation technique appropriate to the problem is defined, along with associated genetic operators and a local search...
متن کاملSolving the University Course Timetabling Problem by Hypercube Framework for ACO
We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restr...
متن کاملA new binary model for university examination timetabling: a case study
Examination timetabling problem (ETP) is one of the most important issues in universities. An improper timetable may result in students' dissatisfaction as it may not let them study enough between two sequential exams. In addition, the many exams to be scheduled, the large number of students who have taken different courses, the limited number of rooms, and some constraints su...
متن کاملUsing fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملارایه یک مدل ریاضی جدید جهت برنامه ریزی جدول زمان بندی دروس دانشگاهی بر اساس کیفیت ارایه دروس
One of the important tasks of universities that are usually challenging is university course timetabling problem. They are faced with this problem every year and every term and which is directly effective on education performance. In the university course timetabling problem, the university sources including lessons, lecturers, classes and other teaching sources are assigned to a series of time...
متن کامل